翻訳と辞書 Words near each other ・ Red (audio drama) ・ Red (band) ・ Red (Black Uhuru album) ・ Recursive ordinal ・ Recursive partitioning ・ Recursive recycling ・ Recursive science fiction ・ Recursive self-improvement ・ Recursive set ・ Recursive transition network ・ Recursive tree ・ Recursive wave ・ Recursive XY-cut ・ Recursively enumerable language ・ Recursively enumerable set ・ Recursively inseparable sets ・ Recurso de amparo ・ Recursolândia ・ Recurt ・ Recurva ・ Recurvaria ・ Recurvaria annulicornis ・ Recurvaria cinerella ・ Recurvaria comprobata ・ Recurvaria consimilis ・ Recurvaria costimaculella ・ Recurvaria dryozona ・ Recurvaria eromene ・ Recurvaria febriculella ・ Recurvaria filicornis Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Recursively inseparable sets ： ウィキペディア英語版 Recursively inseparable sets In computability theory, recursively inseparable sets are pairs of sets of natural numbers that cannot be "separated" with a recursive set (Monk 1976, p. 100). These sets arise in the study of computability theory itself, particularly in relation to . Recursively inseparable sets also arise in the study of Gödel's incompleteness theorem. == Definition == The natural numbers are the set ω = . Given disjoint subsets ''A'' and ''B'' of ω, a separating set ''C'' is a subset of ω such that ''A'' ⊆ ''C'' and ''B'' ∩ ''C'' = ∅ (or equivalently, ''A'' ⊆ ''C'' and ''B'' ⊆ ). For example, ''A'' itself is a separating set for the pair, as is ''ω\B''. If a pair of disjoint sets ''A'' and ''B'' has no recursive separating set, then the two sets are recursively inseparable. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Recursively inseparable sets」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.